Open maps for tessellation automata

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Certain Relations between Properties of Maps of Tessellation Automata

In a different approach, Hedlund [4], Sears [13], and Ryan [12] defined the shift dynamical system and investigated the properties of the continuous transformations which commute with the shift transformations, and showed many interesting results in one-dimensional tessellation spaces. Hedlund conjectured that in some sense, the set A of all parallel maps which are injective on the set C of all...

متن کامل

Open Maps Bisimulations for Higher Dimensional Automata Models

The intention of the paper is to show the applicability of the general categorical framework of open maps to the setting of two models – higher dimensional automata (HDA) and timed higher dimensional automata (THDA) – in order to transfer general concepts of equivalences to the models. First, we define categories of the models under consideration, whose morphisms are to be thought of as simulat...

متن کامل

History-Preserving Bisimilarity for Higher-Dimensional Automata via Open Maps

We show that history-preserving bisimilarity for higher-dimensional automata has a simple characterization directly in terms of higher-dimensional transitions. This implies that it is decidable for finite higher-dimensional automata. To arrive at our characterization, we apply the open-maps framework of Joyal, Nielsen and Winskel in the category of unfoldings of precubical sets.

متن کامل

Cellular Automata in the Triangular Tessellation

For t he discussion below t he following definit ions are helpful. A semito-talistic CA rule is a rul e for a cellular aut omaton (CA) where (a) we tally t he living neighbors t o a cell without regard to their orient atio n wit h respect t o th at cell, and (b) t he ru le applied t o a cell may depend upon its current status. A lifelike rule (LFR rul e) is a semit otalist ic CA rul e where (1)...

متن کامل

Efficient Bounded Adaptive Tessellation of Displacement Maps

Displacement mapping is a technique for applying fine geometric detail to a simpler base surface. The displacement is often specified as a scalar function which makes it relatively easy to increase visual complexity without the difficulties inherent in more general modeling techniques. We would like to use displacement mapping in real-time applications. Ideally, a graphics accelerator should cr...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Theoretical Computer Science

سال: 1983

ISSN: 0304-3975

DOI: 10.1016/0304-3975(83)90101-9